Deciding the VC Dimension is Σ p 3 - complete , II
نویسنده
چکیده
The path VC-dimension of a graph G is the size of the largest set U of vertices of G such that each subset of U is the intersection of U with a subpath of G. The VC-dimension for graphs was introduced by Kranakis, et al. [KKR97], building on an idea of Haussler and Welzl [HW87]. We show that computing the path VC-dimension of a graph is Σp3-complete. This adds a rare natural Σ p 3-complete problem to the repertoire.
منابع مشابه
Deciding the Vapnik-Červonenkis Dimension is Σp3-complete
Linial et al. raised the question of how difficult the computation of the Vapnik-Červonenkis dimension of a concept class over a finite universe is. Papadimitriou and Yannakakis obtained a first answer using matrix representations of concept classes. However, this approach does not capture classes having exponential size, like monomials, which are encountered in learning theory. We choose a mor...
متن کاملDeciding the Vapnik-Cervonenkis dimension is ...-complete
Linial et al. raised the question of how diicult the computation of the Vapnik-ervonenkis dimension of a concept class over a nite universe is. Papadmimitriou and Yannakakis obtained a rst answer using matrix representations of concept classes. We choose a more natural representation , which leads us to redeene the vc dimension problem. We establish that vc dimension is p 3-complete, thereby gi...
متن کاملPAC learning, VC dimension, and the arithmetic hierarchy
We compute that the index set of PAC-learnable concept classes is m-complete Σ 3 within the set of indices for all concept classes of a reasonable form. All concept classes considered are computable enumerations of computable Π 1 classes, in a sense made precise here. This family of concept classes is sufficient to cover all standard examples, and also has the property that PAC learnability is ...
متن کاملOn the Hardness of Almost-Sure Termination
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost–sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is Σ 1– and Σ 0 2–complete, respectively. Deciding (universal) almost–sure termination as well as deciding whether the expected outcome of a program equals a gi...
متن کاملThe Complexity of the Partial Order Dimension Problem: Closing the Gap
The dimension of a partial order P is the minimum number of linear orders whose intersection is P . There are efficient algorithms to test if a partial order has dimension at most 2. In 1982 Yannakakis [24] showed that for k ≥ 3 to test if a partial order has dimension ≤ k is NP-complete. The height of a partial order P is the maximum size of a chain in P . Yannakakis also showed that for k ≥ 4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000